全文获取类型
收费全文 | 669篇 |
免费 | 75篇 |
国内免费 | 20篇 |
专业分类
化学 | 37篇 |
晶体学 | 1篇 |
力学 | 1篇 |
综合类 | 13篇 |
数学 | 657篇 |
物理学 | 55篇 |
出版年
2023年 | 7篇 |
2022年 | 16篇 |
2021年 | 24篇 |
2020年 | 16篇 |
2019年 | 28篇 |
2018年 | 14篇 |
2017年 | 25篇 |
2016年 | 12篇 |
2015年 | 13篇 |
2014年 | 32篇 |
2013年 | 54篇 |
2012年 | 32篇 |
2011年 | 48篇 |
2010年 | 43篇 |
2009年 | 32篇 |
2008年 | 47篇 |
2007年 | 57篇 |
2006年 | 39篇 |
2005年 | 22篇 |
2004年 | 17篇 |
2003年 | 25篇 |
2002年 | 13篇 |
2001年 | 16篇 |
2000年 | 21篇 |
1999年 | 14篇 |
1998年 | 13篇 |
1997年 | 9篇 |
1996年 | 7篇 |
1995年 | 12篇 |
1994年 | 14篇 |
1993年 | 3篇 |
1992年 | 6篇 |
1991年 | 6篇 |
1990年 | 2篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1987年 | 2篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1984年 | 4篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有764条查询结果,搜索用时 46 毫秒
1.
We consider the optimal service control of a multiclass M/G/1 queueing system in which customers are served nonpreemptively and the system cost rate is additive across classes and increasing convex in the numbers present in each class. Following Whittle's approach to a class of restless bandit problems, we develop a Langrangian relaxation of the service control problem which serves to motivate the development of a class of index heuristics. The index for a particular customer class is characterised as a fair charge for service of that class. The paper develops these indices and reports an extensive numerical investigation which exhibits strong performance of the index heuristics for both discounted and average costs. 相似文献
2.
3.
We develop a production policy that controls work-in-process (WIP) levels and satisfies demand in a multistage manufacturing system with significant uncertainty in yield, rework, and demand. The problem addressed in this paper is more general than those in the literature in three aspects: (i) multiple products are processed at multiple workstations, and the capacity of each workstation is limited and shared by multiple operations; (ii) the behavior of a production policy is investigated over an infinite-time horizon, and thus the system stability can be evaluated; (iii) the representation of yield and rework uncertainty is generalized. Generalizing both the system structure and the nature of uncertainty requires a new mathematical development in the theory of infinite-horizon stochastic dynamic programming. The theoretical contributions of this paper are the existence proofs of the optimal stationary control for a stochastic dynamic programming problem and the finite covariances of WIP and production levels under the general expression of uncertainty. We develop a simple and explicit sufficient condition that guarantees the existence of both the optimal stationary control and the system stability. We describe how a production policy can be constructed for the manufacturing system based on the propositions derived. 相似文献
4.
5.
任胜兵 《武汉大学学报(理学版)》2006,52(5):644-648
针对基于Web的图书馆管理系统资源访问控制的动态性问题,提出了一种基于角色的访问控制策略描述方案.通过对基于Web的图书馆管理系统访问控制管理影响因素和访问控制需求的分析,结合NIST基于角色的访问控制统一模型标准,构造了一种基于角色的访问控制元模型.并在这一元模型的基础上,提出了一种紧凑的基于角色的访问控制XML策略描述语言框架.结果表明该访问控制策略描述语言框架适合表述动态环境下对图书馆资源的访问策略,提高了基于Web的图书馆管理系统资源访问的安全性. 相似文献
6.
This article studies the inshore-offshore fishery model with impulsive diffusion. The existence and global asymptotic stability of both the trivial periodic solution and the positive periodic solution are obtained. The complexity of this system is also analyzed. Moreover, the optimal harvesting policy are given for the inshore subpopulation, which includes the maximum sustainable yield and the corresponding harvesting effort. 相似文献
7.
In this paper we apply linear control theory to study the effect of various inventory policies on order and inventory variability, which are key drivers of supply chain performance. In particular, we study a two-echelon supply chain with a stationary demand pattern under the influence of three inventory policies: an inventory-on-hand policy that bases orders on the visible inventory at an installation, an installation-stock policy that bases orders on the inventory position (on-hand plus on-order inventory) at an installation, and an echelon-stock policy that bases orders on the inventory position at that installation and all downstream installations. We prove analytically that the inventory-on-hand policy is unstable in practical settings, confirming analytically what has been observed in experimental settings and in practice. We also prove that the installation-stock and echelon-stock policies are stable and analyze their effect on order and inventory fluctuation. Specifically, we show the general superiority of the echelon-stock in our setting and demonstrate analytically the effect of forecasting parameters on order and inventory fluctuations, confirming the results in other research. 相似文献
8.
技术的动态发展和企业间的竞争对企业新产品策略有很大影响,直接决定新产品的引进周期。本文在产业技术动态变化的随机环境下构建随机动态规划模型,关注产业技术进步、投资成本和产品市场竞争等影响因素,探讨企业进行新产品引进的周期选择,对新产品引进的周期和质量决策进行方法设计和应用举例。利用随机动态规划模型得出新产品引进的最优时间周期,用算例分析技术进步和产品研发成本对企业引进周期策略的影响,采取策略迭代的方法进行求解,发现技术进步较快时企业的新产品引进步伐也较快,研发成本的提高使企业的新产品引入步伐降低。 相似文献
9.
本主要介绍原木经销商在周期内原木变价销售情况下的最佳期初贮存量的决策方法,在建立期望机会成本的数学模型基础上,探讨原木随机存贮策略的最优化问题。 相似文献
10.
Ronald H. Nickel Igor Mikolic-Torreira Jon W. Tolle 《Computational Optimization and Applications》2006,35(1):109-126
Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked
on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready
to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the
cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the
Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements
of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear
and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization
viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions
are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives
are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult
to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation
and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this
problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed
version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern
search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned
as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous
computers in an office environment, thus, drastically reducing the time required to find the solution. 相似文献